Almost Independent and Weakly Biased Arrays: Eecient Constructions and Cryptologic Applications

Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications

The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same parameters. We present new efficient coding-theoretic constructions, which allow farreaching generalizations and improvements. The classical constructions can be described as making use of Reed-Solomon codes. Our rec...

Eecient Constructions of ?biased Arrays, ?dependent Arrays and Authentication Codes

Almost n-Multiplicative Maps‎ between‎ ‎Frechet Algebras

For the Fr'{e}chet algebras $(A, (p_k))$ and $(B, (q_k))$ and $n in mathbb{N}$, $ngeq 2$, a linear map $T:A rightarrow B$ is called textit{almost $n$-multiplicative}, with respect to $(p_k)$ and $(q_k)$, if there exists $varepsilongeq 0$ such that$$q_k(Ta_1a_2cdots a_n-Ta_1Ta_2cdots Ta_n)leq varepsilon p_k(a_1) p_k(a_2)cdots p_k(a_n),$$for each $kin mathbb{N}$ and $a_1, a_2, ldots, a_nin A$. Th...

On upper and lower almost weakly continuous fuzzy multifunctions

The aim of this paper is to introduce the concepts of fuzzy upper and fuzzy lower almost continuous, weakly continuous and almost weakly continuous multifunctions. Several characterizations and properties of these multifunctions along with their mutual relationships are established in $L$-fuzzy topological spaces

New Constructions for Perfect Hash Families andRelated Structures using Combinatorial

In this paper, we consider explicit constructions of perfect hash families using combi-natorial methods. We provide several direct constructions from combinatorial structures related to orthogonal arrays. We also simplify and generalize a recursive construction due to Atici, Magliversas, Stinson and Wei 3]. Using similar methods, we also obtain eecient constructions for separating hash families...